Upgraded methods for the effective computation of marked schemes on a strongly stable ideal

نویسندگان

  • Cristina Bertone
  • Francesca Cioffi
  • Paolo Lella
  • Margherita Roggero
چکیده

Let J ⊂ S = K[x0, . . . , xn] be a monomial strongly stable ideal. The collection Mf(J) of the homogeneous polynomial ideals I, such that the monomials outside J form a K-vector basis of S/I, is called a J-marked family. It can be endowed with a structure of affine scheme, called a J-marked scheme. For special ideals J , J-marked schemes provide an open cover of the Hilbert scheme Hilbnp(t), where p(t) is the Hilbert polynomial of S/J . Those ideals more suitable to this aim are the m-truncation ideals J≥m generated by the monomials of degree ≥ m in a saturated strongly stable monomial ideal J . Exploiting a characterization of the ideals in Mf(J≥m) in terms of a Buchberger-like criterion, we compute the equations defining the J≥m-marked scheme by a new reduction relation, called superminimal reduction, and obtain an embedding of Mf(J≥m) in an affine space of low dimension. In this setting, explicit computations are achievable in many non-trivial cases. Moreover, for every m, we give a closed embedding φm :Mf(J≥m) ↪→Mf(J≥m+1), characterize those φm that are isomorphisms in terms of the monomial basis of J , especially we characterize the minimum integer m0 such that φm is an isomorphism for every m ≥ m0.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strongly stable multi-time stepping method with the option of controlling amplitude decay in responses

Recently, multi-time stepping methods have become very popular among scientist due to their high stability in problems with critical conditions. One important shortcoming of these methods backs to their high amount of uncontrolled amplitude decay. This study proposes a new multi-time stepping method in which the time step is split into two sub-steps. The first sub-step is solved using the well-...

متن کامل

Computation of Hilbert Schemes

Hilbert schemes are a basic topic in Algebraic Geometry [1, 2]. Methods related to Gröbner bases are fundamental here, as Hartshorne’s proof of the connectedness of Hilbert schemes via generic initial ideals demonstrates [3]. For many purposes, the explicit construction of Hilbert schemes is important. Classical approaches lead to prohibitively large equations. Newer ideas like Gröbner strata [...

متن کامل

High-accuracy alternating segment explicit-implicit method for the fourth-order heat equation

Based on a group of new Saul’yev type asymmetric difference schemes constructed by author, a high-order, unconditionally stable and parallel alternating segment explicit-implicit method for the numerical solution of the fourth-order heat equation is derived in this paper. The truncation error is fourth-order in space, which is much more accurate than the known alternating segment explicit-impli...

متن کامل

APPROXIMATION OF STOCHASTIC PARABOLIC DIFFERENTIAL EQUATIONS WITH TWO DIFFERENT FINITE DIFFERENCE SCHEMES

We focus on the use of two stable and accurate explicit finite difference schemes in order to approximate the solution of stochastic partial differential equations of It¨o type, in particular, parabolic equations. The main properties of these deterministic difference methods, i.e., convergence, consistency, and stability, are separately developed for the stochastic cases.

متن کامل

Sums of Strongly z-Ideals and Prime Ideals in ${mathcal{R}} L$

It is well-known that the sum of two $z$-ideals in $C(X)$ is either $C(X)$ or a $z$-ideal. The main aim of this paper is to study the sum of strongly $z$-ideals in ${mathcal{R}} L$, the ring of real-valued continuous functions on a frame $L$. For every ideal $I$ in ${mathcal{R}} L$, we introduce the biggest strongly $z$-ideal included in $I$ and the smallest strongly $z$-ideal containing ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2013